Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size
نویسندگان
چکیده
A graph G is said to be Cl-saturated if G contains no cycle of length l, but for any edge in the complement of G the graph G + e does contain a cycle of length l. The minimum number of edges of a Cl-saturated graph was shown by Barefoot et al. to be between n + c1 n l and n + c2 n l for some positive constants c1 and c2. This confirmed a conjecture of Bollobás. Here we improve the value of c2 for l ≥ 8. the electronic journal of combinatorics 13 (2006), #R00 1
منابع مشابه
On the Number of Edges in a Minimum C6-Saturated Graph
A graph is said to be Ck-saturated if it contains no cycles of length k but does contain such a cycle after the addition of any edge in the complement of the graph. Determining the minimum size of Ck-saturated graphs is one of the interesting problems on extremal graphs. The exact minimum sizes are known for k = 3, 4 and 5, but only general bounds are shown for k ≥ 6. This paper deals with boun...
متن کاملUpper Bounds on the Minimum Size of Hamilton Saturated Hypergraphs
For 1 6 ` < k, an `-overlapping k-cycle is a k-uniform hypergraph in which, for some cyclic vertex ordering, every edge consists of k consecutive vertices and every two consecutive edges share exactly ` vertices. A k-uniform hypergraph H is `-Hamiltonian saturated if H does not contain an `-overlapping Hamiltonian k-cycle but every hypergraph obtained from H by adding one edge does contain such...
متن کاملOn Zagreb Energy and edge-Zagreb energy
In this paper, we obtain some upper and lower bounds for the general extended energy of a graph. As an application, we obtain few bounds for the (edge) Zagreb energy of a graph. Also, we deduce a relation between Zagreb energy and edge-Zagreb energy of a graph $G$ with minimum degree $delta ge2$. A lower and upper bound for the spectral radius of the edge-Zagreb matrix is obtained. Finally, we ...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 13 شماره
صفحات -
تاریخ انتشار 2006